Equation Satisfiability in Solvable Groups
نویسندگان
چکیده
Abstract The study of the complexity equation satisfiability problem in finite groups had been initiated by Goldmann and Russell (Inf. Comput. 178 (1), 253–262, 2002) where they showed that this is for nilpotent while it -complete non-solvable groups. Since then, several results have appeared showing can be solved polynomial time certain solvable G having a normal subgroup H with factor / . This paper shows such must exist each group time, unless Exponential Time Hypothesis fails.
منابع مشابه
An exactly solvable random satisfiability problem
We introduce a new model for the generation of random satisfiability problems. It is an extension of the hyper-SAT model of Ricci-Tersenghi, Weigt and Zecchina, which is a variant of the famous K-SAT model: it is extended to q-state variables and relates to a different choice of the statistical ensemble. The model has an exactly solvable statistic: the critical exponents and scaling functions o...
متن کاملCharacterization of Solvable Groups and Solvable radical
We give a survey of new characterizations of finite solvable groups and the solvable radical of an arbitrary finite group which were obtained over the past decade. We also discuss generalizations of these results to some classes of infinite groups and their analogues for Lie algebras. Some open problems are discussed as well.
متن کاملComputing in Solvable Matrix Groups
We announce methods for e cient management of solvable matrix groups over nite elds. We show that solvability and nilpotence can be tested in polynomial-time. Such e ciency seems unlikely for membership-testing, which subsumes the discrete-log problem. However, assuming that the primes in jGj (other than the eld characteristic) are polynomiallybounded, membership-testing and many other computat...
متن کاملUndistorted Solvable Linear Groups
We discuss distortion of solvable linear groups over a locally compact field and provide necessary and sufficient conditions for a subgroup to be undistorted when the field is of characteristic zero.
متن کاملSome Solvable Automaton Groups
It is shown that certain ascending HNN extensions of free abelian groups of finite rank, as well as various lamplighter groups, can be realized as automaton groups, i.e., can be given a self-similar structure. This includes the solvable Baumslag-Solitar groups BS(1, m), for m 6= ±1. In addition, it is shown that, for any relatively prime integers m, n ≥ 2, the pair of Baumslag-Solitar groups BS...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theory of computing systems
سال: 2022
ISSN: ['1432-4350', '1433-0490']
DOI: https://doi.org/10.1007/s00224-022-10082-z